Toric Surface Codes and Minkowski Length of Polygons
نویسندگان
چکیده
In this paper we prove new lower bounds for the minimum distance of a toric surface code CP defined by a convex lattice polygon P ⊂ R 2 . The bounds involve a geometric invariant L(P ) , called the full Minkowski length of P which can be easily computed for any given P .
منابع مشابه
Minkowski Length of 3D Lattice Polytopes
We study the Minkowski length L(P ) of a lattice polytope P , which is defined to be the largest number of non-trivial primitive segments whose Minkowski sum lies in P . The Minkowski length represents the largest possible number of factors in a factorization of polynomials with exponent vectors in P , and shows up in lower bounds for the minimum distance of toric codes. In this paper we give a...
متن کاملToric Surface Codes and Minkowski Sums
Toric codes are evaluation codes obtained from an integral convex polytope P ⊂ R and finite field Fq. They are, in a sense, a natural extension of Reed-Solomon codes, and have been studied recently in [6], [8], [9], and [12]. In this paper, we obtain upper and lower bounds on the minimum distance of a toric code constructed from a polygon P ⊂ R by examining Minkowski sum decompositions of subpo...
متن کاملOn classification of toric surface codes of low dimension
This work is a natural continuation of our previous work [YZ]. In this paper, we give a complete classification of toric surface codes of dimension equal to 6, except a special pair, C P (4) 6 and C P (5) 6 over F8. Also, we give an example, C P (5) 6 and C P (6) 6 over F7, to illustrate that two monomially equivalent toric codes can be constructed from two lattice non-equivalent polygons.
متن کاملSmall polygons and toric codes
We describe two different approaches to making systematic classifications of plane lattice polygons, and recover the toric codes they generate, over small fields, where these match or exceed the best known minimum distance. This includes a [36, 19, 12]-code over F7 whose minimum distance 12 exceeds that of all previously known codes.
متن کاملMinkowski decomposition of convex lattice polygons
A relatively recent area of study in geometric modelling concerns toric Bézier patches. In this line of work, several questions reduce to testing whether a given convex lattice polygon can be decomposed into a Minkowski sum of two such polygons and, if so, to finding one or all such decompositions. Other motivations for this problem include sparse resultant computation, especially for the impli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 23 شماره
صفحات -
تاریخ انتشار 2009